Computational complexity theory

Results: 2049



#Item
961Making Queries Tractable on Big Data with Preprocessing (through the eyes of complexity theory) Wenfei Fan Floris Geerts

Making Queries Tractable on Big Data with Preprocessing (through the eyes of complexity theory) Wenfei Fan Floris Geerts

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2013-08-01 05:50:27
962Algorithmica[removed]: 379–399 DOI[removed]s00453[removed]Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions Yury Lifshits · Shay Mozes · Oren Weimann ·

Algorithmica[removed]: 379–399 DOI[removed]s00453[removed]Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions Yury Lifshits · Shay Mozes · Oren Weimann ·

Add to Reading List

Source URL: yury.name

Language: English - Date: 2009-11-15 04:24:21
963FerienAkademie[removed]Course ”Quantum computation” Quantum algorithm for Hilbert’s 10th problem

FerienAkademie[removed]Course ”Quantum computation” Quantum algorithm for Hilbert’s 10th problem

Add to Reading List

Source URL: yury.name

Language: English - Date: 2006-01-02 14:44:12
964Open Problems TO GO Yury Lifshits Caltech http://yury.name MIT, 30 November 2007

Open Problems TO GO Yury Lifshits Caltech http://yury.name MIT, 30 November 2007

Add to Reading List

Source URL: yury.name

Language: English - Date: 2007-12-01 00:38:44
965On the Complexity of Query Result Diversification 1 Ting Deng1  Wenfei Fan2,1

On the Complexity of Query Result Diversification 1 Ting Deng1 Wenfei Fan2,1

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2013-06-29 06:38:52
966R Foundations and Trends
 in Theoretical Computer Science Vol. 9, No–123 c 2013 S. Jukna and I. Sergeev

R Foundations and Trends in Theoretical Computer Science Vol. 9, No–123 c 2013 S. Jukna and I. Sergeev

Add to Reading List

Source URL: lovelace.thi.informatik.uni-frankfurt.de

Language: English - Date: 2014-01-24 16:28:13
967A Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard, University of California at Berkeley James Demmel, University of California at Berkeley ¨ Berlin

A Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard, University of California at Berkeley James Demmel, University of California at Berkeley ¨ Berlin

Add to Reading List

Source URL: www.sandia.gov

Language: English - Date: 2013-10-08 19:02:08
968Tutorial: Exact Numerical Computation in Algebra and Geometry Chee K. Yap Courant Institute of Mathematical Sciences New York University

Tutorial: Exact Numerical Computation in Algebra and Geometry Chee K. Yap Courant Institute of Mathematical Sciences New York University

Add to Reading List

Source URL: cs.nyu.edu

Language: English - Date: 2009-07-27 23:31:09
969Homework Two, for Fri[removed]CSE 101 When specifying an algorithm, please use pseudocode that is simple and unambiguous. Always justify the correctness and running time of the algorithm, unless these are obvious.

Homework Two, for Fri[removed]CSE 101 When specifying an algorithm, please use pseudocode that is simple and unambiguous. Always justify the correctness and running time of the algorithm, unless these are obvious.

Add to Reading List

Source URL: cseweb.ucsd.edu

Language: English - Date: 2014-10-12 01:34:34
970Specula(ng	
  Seriously	
    Rachid	
  Guerraoui,	
  EPFL	
   The	
  World	
  is	
  turning	
  IT	
   IT	
  is	
  turning	
  distributed	
  

Specula(ng  Seriously   Rachid  Guerraoui,  EPFL   The  World  is  turning  IT   IT  is  turning  distributed  

Add to Reading List

Source URL: lpdwww.epfl.ch

Language: English - Date: 2010-10-12 11:08:22